TCP modeling in the presence of nonlinear window growth
نویسندگان
چکیده
We develop a model for TCP that accounts for both sublinearity and limitation of window increase. Sublinear window growth is observed when the round-trip time of the connection increases with the window size. The limitation is due to the window advertised by the receiver. First, we derive the required conditions for the stability of the model. Then, we write the Kolmogorov equation under Markovian assumptions. The model is solved analytically for some particular cases. A good match between the throughput predicted by the model and the throughput measured on real TCP connections is reported.
منابع مشابه
Modeling TCP/RED: a dynamical approach
Interaction between Transmission Control Protocol (TCP) and Random Early Detection (RED) gateways can be captured using dynamical models. The communication network is viewed as a discrete-time feedback control system where TCP adjusts its window size depending on whether or not it has detected a packet loss during the previous round trip time (RTT) interval. In this article, we describe a discr...
متن کاملTCP Network Calculus: The case of large delay-bandwidth product
We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate our model as a nonlinear complementarity problem. Then we transform the model into two equivalent formulations: fixed point formulation and nonlinear programming formulation. These equivalent formulations provide efficient computat...
متن کاملBinomial Congestion Control Algorithms
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each congestion indication (or loss) is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a ...
متن کاملS-shaped TCP: A new transport protocol for fast long-distance networks
It is well known that TCP does not fully utilize the available bandwidth in fast long-distance networks. Several high speed transport protocols have been proposed in an effort to solve this scalability problem. This paper proposes S-shaped TCP (SS-TCP). The window growth function of SS-TCP is, in the steady state, S-shaped, and it can be divided into three regions. In region I, the window growt...
متن کاملTCP-friendly Congestion Control for Real-time Streaming Applications
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon congestion is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current win...
متن کامل